Using Power-Law Degree Distribution to Accelerate PageRank
نویسندگان
چکیده
منابع مشابه
Similarity Measures for Link Prediction Using Power Law Degree Distribution
Link Prediction deals with predicting important non-existent edges in a social network that are likely to occur in the near future. Typically a link between two nodes is predicted if the two nodes have high similarity. Well-known local similarity functions make use of information from all the local neighbors. These functions use the same form irrespective of the degree of the common neighbors. ...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Power-law node degree distribution in online affiliation networks
The purpose of this article is to present a preferential attachment model adjusted to generation of bipartite graphs. The original model is able to produce unipartite graphs with node degree distribution following power law relation. The motivation for extending classic model is the fact that multi-partite graph topologies are becoming more and more popular in social networks. This phenomenon r...
متن کاملComputing PageRank using Power Extrapolation
We present a novel technique for speeding up the computation of PageRank, a hyperlink-based estimate of the “importance” of Web pages, based on the ideas presented in [7]. The original PageRank algorithm uses the Power Method to compute successive iterates that converge to the principal eigenvector of the Markov matrix representing the Web link graph. The algorithm presented here, called Power ...
متن کاملScalable Computing for Power Law Graphs: Experience with Parallel PageRank
In this paper we report on the behavior of parallel numerical algorithms applied to computing the PageRank vector for a 1.5 billion node directed webgraph. We also describe the details of our parallel implementation that was able to compute the PageRank vector for this webgraph on a distributed memory 140 processor RLX cluster in under 6 minutes. Historically, much of the work in parallel compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Engineering and Applications Journal
سال: 2012
ISSN: 2252-5459,2252-4274
DOI: 10.18495/comengapp.v1i2.8